Explicit formulas for the variance of conditioned sojourn times in M/D/1-PS
نویسنده
چکیده
For the M/D/1 processor sharing queue, explicit formulas for the coefficient of variation of the sojourn time conditioned on the service time and on the residual service times of the tasks found on arrival are derived via branching representations. keywords: processor sharing, sojourn times, variance, branching
منابع مشابه
A sample path relation for the sojourn times in G/G/1-PS systems and its applications
For the general G/G/1 processor sharing (PS) system a sample path result for the sojourn times in a busy period is proved, which yields a relation between the sojourn times under PS and FCFS discipline. In particular, the result provides a formula for the mean sojourn time in G/D/1-PS in terms of the mean sojourn time in the corresponding G/D/1-FCFS, generalizing known results for GI/M/1 and M/...
متن کاملPii: S0166-5316(02)00121-9
The study presented in this paper is motivated by the performance analysis of response times in distributed information systems, where transactions are handled by iterative server and database actions. We model system response times as sojourn times in a two-node open queueing network with a processor sharing (PS) node and a first-come-first-served (FCFS) node. External customers arrive at the ...
متن کاملA Method for Approximating the Variance of the Sojourn Times in Star-Shaped Queueing Networks
We study the sojourn times in an open star-shaped queueing network, with a central processor-sharing (PS) node 0 and M ≥ 1 multi-server First-Come-First Served (FCFS) nodes. Each customer alternatingly visits the central node and one of the other nodes, in the order 0, 1, 0, 2, . . . , 0,M, 0, before departing from the system. For this model, exact expressions for the mean sojourn time can be e...
متن کاملSojourn time approximations in queueing networks with feedback
This paper is motivated by the response-time analysis of distributed information systems, where transactions are handled by a sequence of front-end server and back-end server actions. We study sojourn times in an open queueing network with a single Processor Sharing (PS) node and an arbitrary number of M multi-server First-Come-First-Served (FCFS) nodes. Customers arrive at the PS according to ...
متن کاملAn explicit formula for the number of fuzzy subgroups of a finite abelian $p$-group\ of rank two
Ngcibi, Murali and Makamba [Fuzzy subgroups of rank two abelian$p$-group, Iranian J. of Fuzzy Systems {bf 7} (2010), 149-153]considered the number of fuzzy subgroups of a finite abelian$p$-group $mathbb{Z}_{p^m}times mathbb{Z}_{p^n}$ of rank two, andgave explicit formulas for the cases when $m$ is any positiveinteger and $n=1,2,3$. Even though their method can be used for thecases when $n=4,5,l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Oper. Res. Lett.
دوره 35 شماره
صفحات -
تاریخ انتشار 2007